| 翻訳と辞書 |
| hypohamiltonian graph ： ウィキペディア英語版 |
hypohamiltonian graph
In the mathematical field of graph theory, a graph ''G'' is said to be hypohamiltonian if ''G'' does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from ''G'' is Hamiltonian.
==History==
Hypohamiltonian graphs were first studied by . cites and as additional early papers on the subject; another early work is by .
sums up much of the research in this area with the following sentence: “The articles dealing with those graphs ... usually exhibit new classes of hypohamiltonian or hypotraceable graphs showing that for certain orders ''n'' such graphs indeed exist or that they possess strange and unexpected properties.”
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「hypohamiltonian graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|